The Transitivity Problem of Turing Machines
نویسندگان
چکیده
A Turing machine is topologically transitive if every partial configuration — that is a state, a head position, plus a finite portion of the tape — can reach any other partial configuration, provided that it is completed into a proper configuration. We characterize topological transitivity and study its computational complexity in the dynamical system models of Turing machines with moving head, moving tape and for the trace-shift. We further study minimality, the property of every configuration reaching every partial configuration.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملQuantum Algorithms, Paraconsistent Computation and Deutsch's Problem
We present the new model of paraconsistent Turing machines and revise the models of quantum Turing machines and quantum circuits, stressing the concepts of entangled states and quantum parallelism which are important features for efficient quantum algorithms. We revise a quantum circuit that solves the so-called Deutsch’s problem, and then provide another solution to Deutsch’s problem by means ...
متن کاملQuantum Turing Machines: Local Transition, Preparation, Measurement, and Halting
The Church-Turing thesis 2 states that to be computable is to be computable by a Turing machine and the modern discipline in computational complexity theory states that to be efficiently computable is to be computable by a Turing machine within polynomial steps in the length of the input data. However, Feynman pointed out that a Turing machine cannot simulate a quantum mechanical process effici...
متن کاملAutomata Theory - Final (Solutions)
1. Diagonalization: The Halting problem is defined as follows: Given a TuringMachineM = 〈Q, {0, 1},Γ, δ, q0,2, F 〉 and a string w ∈ Σ∗, determine whether M halts on w. In class, we proved that the Halting problem is undecidable using two different techniques. The first technique was constructive, where we constructed a series of Turing Machines, which led to a contradiction. The second techniqu...
متن کاملComparing uncertainty data in epistemic and ontic sense used to decision making problem
In the paper aspect of comparability alternatives in decision making problem by imprecise or incomplete information isexamined. In particular, new definitions of transitivity based on the measure of the intensity preference between pairsof alternatives in epistemic and ontic case is presented and its application to solve decision making problem is proposed.
متن کامل